Acyclic Logic Programs and the Completeness of SLDNF-Resolution
نویسنده
چکیده
Cavedon, L., Acyclic logic programs and the completeness of SLDNF-resolution, Theoretical Computer Science 86 (1991) 81-92. This paper investigates the class of acyclic programs, programs with the usual hierarchical condition imposed on ground instances of atoms rather than predicate symbols. The acyclic condition seems to naturally capture much of the recursion that occurs in practice and many programs that arise in practical programming satisfy this condition. We prove completeness of SLDNF-resolution for the acyclic programs and discuss several other desirable properties exhibited by programs belonging to this class.
منابع مشابه
Completeness of SLDNF-Resolution for Non-Floundering Queries
W LODZIMIERZ DRABENT. SLDNF-resolution is a standard operational semantics for negation as ((nite) failure. For some programs and goals SLDNF-resolution is incomplete with respect to the Kunen semantics (program completion in 3-valued logic). Intuitively, the reason of incompleteness is oundering. This fact has however not been proven formally. The existing papers study syntactic classes of pro...
متن کاملOn Sldnf-resolution in Logic Programming with Negation
The paper is devoted to the logic programming with negation and with built-in predicates. General logic programs (logic programs with negation) and general goals (goals with negation) are considered. Modification of SLDNF-resolution for built-in predicates is introduced. The soundness of modified SLDNF-resolution is proved. SLDNF-resolution used in real systems (practical SLDNF-resolution) is c...
متن کاملCompleteness of Depth-bounded Resolution for Weakly Reducing Programs
In this paper we present the class of general logic programs which has a special kind of stratiications, called the locally nite stratiication. For the class, good properties of propositional logic programs, such as termination and safeness, are preserved. Using these properties, we show the completeness of a kind of SLDNF-resolution that use a depth bound, called depth bounded resolution, with...
متن کاملA Class of Programs for which SLDNF Resolution and NAF Rule are Complete
Baratella, S., A class of programs for which SLDNF resolution and NAF rule are complete, Theoretical Computer Science 120 (1993) 83-99. In this paper, we prove completeness of SLDNF resolution and NAF rule for the class of allowed and locally strati’ed programs satisfying the further condition of well-behauedness. Well-behavedness imposes a computational restriction on programs whose aim is to ...
متن کاملThe SLGAD Procedure for Inference on Logic Programs with Annotated Disjunctions
Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of well founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. The paper presents SLGAD resolution that computes the (conditional) probability of a ground query from an LPAD and is bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 86 شماره
صفحات -
تاریخ انتشار 1991